Extension of universal cycles for globally identifying colorings of cycles

Acyclic Colorings of Products of Cycles

An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of products of paths and cycles are considered. We determine the acyclic chromatic numbers of three such products: grid graphs...

Dating Business Cycle in Oil Exporting Countries

In this paper, we empirically investigate the relationship between oil price changes and output in a group of oil exporting countries. The dynamics of business cycles in Libya, Saudi Arabia, Nigeria, Kuwait, Venezuela and Qatar are modeled by alternative regime switching models. We show that the extension of uni-variate Markov Switching model in order to include oil revenue improves dating busi...

Hamiltonian Colorings of Graphs with Long Cycles

By a hamiltonian coloring of a connected graph G of order n > 1 we mean a mapping c of V (G) into the set of all positive integers such that |c(x) − c(y)| > n − 1 − DG(x, y) (where DG(x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ G. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of or...

Comparison of Indicators for Determining the Thresholds of Banks' Financial Crisis in EWS Based on Business Cycles

 The purpose of this paper is to design a prediction system for thresholds of the bankruptcy of banks based on the business cycle and examine the effects of different approaches in defining the bankruptcy threshold in predicting bankruptcy time of Iranian banks using the Kaplan-Meier and Cox Proportional-Hazards Models. So, the data of listed banks in Tehran Stock Exchange were used from 1385-1...

On the Defining Number of (2n - 2)-Vertex Colorings of Kn x Kn